Technical Note—Optimal Scheduling of Periodic Activities
نویسندگان
چکیده
منابع مشابه
Scheduling periodic Tasks on Multiple Periodic Resources
In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource i...
متن کاملMultidimensional periodic scheduling
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملPeriodic Metro Scheduling
We introduce the Periodic Metro Scheduling (PMS) problem, which aims in generating a periodic timetable for a given set of routes and a given time period, in such a way that the minimum time distance between any two successive trains that pass from the same point of the network is maximized. This can be particularly useful in cases where trains use the same rail segment quite often, as happens ...
متن کاملPeriodic Multiprocessor Scheduling
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملScheduling periodic events
Problem 1.1 is solved explicitly by Burkard [3] for the case n = 2 and for arbitrary n, but with at most two distinct values mi. Burkard attributes the problem to Guldan [S], who, in turn, attributes it to Cerny [4]. In [4,5] the problem is stated as follows: How should regular pi-gons, i= 1,2, . . . , n, be inscribed in a circle so as to maximize the distance between the closest vertices on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1985
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.33.3.690